An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms

نویسندگان

  • Fausto Di Biase
  • Rüdiger L. Urbanke
چکیده

This work was carried out while the authors were at Washington University, St. Louis, in the Mathematics and Electrical Engineering Departments, respectively. Di Biase thanks the C.N.R. (Italy) for support, through grants 203.01.55 and 203.01.63. We propose an improvement upon the standard algorithm for computing the kernel of a polynomial map, assuming that the map sends monomials into monomials. Rather than computing a Gröbner basis in the joint polynomial ring, and then selecting only the elements of interest, we show that a moderate number of iterations of the Buchberger algorithm in the variables of the domain suffices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ring structures of mod p equivariant cohomology rings and ring homomorphisms between them

In this paper, we consider a class of connected oriented (with respect to Z/p) closed G-manifolds with a non-empty finite fixed point set, each of which is G-equivariantly formal, where G = Z/p and p is an odd prime. Using localization theorem and equivariant index, we give an explicit description of the mod p equivariant cohomology ring of such a G-manifold in terms of algebra. This makes ...

متن کامل

کاربرد ماشین بردار پشتیبان در طبقه‌بندی کاربری اراضی حوزه چشمه کیله- چالکرود

Classification of land use extraction always been one of the most important applications of remote sensing and why different methods are created. Over time and with greater accuracy were developed more advanced methods that increase the accuracy and the extraction classes that were closer together in terms of quality are better. SVM is one of these methods in the study of this method for the ex...

متن کامل

Ideal of Lattice homomorphisms corresponding to the products of two arbitrary lattices and the lattice [2]

Abstract. Let L and M be two finite lattices. The ideal J(L,M) is a monomial ideal in a specific polynomial ring and whose minimal monomial generators correspond to lattice homomorphisms ϕ: L→M. This ideal is called the ideal of lattice homomorphism. In this paper, we study J(L,M) in the case that L is the product of two lattices L_1 and L_2 and M is the chain [2]. We first characterize the set...

متن کامل

Impact of Patients’ Gender on Parkinson’s disease using Classification Algorithms

In this paper the accuracy of two machine learning algorithms including SVM and Bayesian Network are investigated as two important algorithms in diagnosis of Parkinson’s disease. We use Parkinson's disease data in the University of California, Irvine (UCI). In order to optimize the SVM algorithm, different kernel functions and C parameters have been used and our results show that SVM with C par...

متن کامل

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Experimental Mathematics

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1995